Equilibria in bottleneck games

نویسندگان

چکیده

Abstract This paper introduces a bottleneck game with finite sets of commuters and departing time slots as an extension congestion games Konishi et al. (J Econ Theory 72:225–237, 1997a). After characterizing Nash equilibrium the game, we provide sufficient conditions for which equivalence between strong equilibria holds. Somewhat surprisingly, unlike in games, pure strategies may often fail to exist, even when players are homogeneous. In contrast, there is continuum atomless players, existence set hold (Konishi

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equilibria in Bottleneck Games∗

This paper introduces a bottleneck game with finite sets of commuters and departing time slots as an extension of congestion games by Milchtaich (1996). After characterizing Nash equilibrium of the game, we provide sufficient conditions for which the equivalence between Nash and strong equilibria holds. Somewhat surprisingly, unlike in congestion games, a Nash equilibrium in pure strategies may...

متن کامل

Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute stro...

متن کامل

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games

We study the inefficiency of equilibrium outcomes in bottleneck congestion games. These games model situations in which strategic players compete for a limited number of facilities. Each player allocates his weight to a (feasible) subset of the facilities with the goal to minimize the maximum (weight-dependent) latency that he experiences on any of these facilities. We derive upper and (asympto...

متن کامل

Bottleneck Games in Noncooperative Networks

We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, each associated with a positive flow demand, and a load-dependent performance function for each network element. We first prove the existence of a Nash equilibrium, considering two routing scenarios, namely when a user can ...

متن کامل

Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic

We look at the scenario of having to route a continuous rate of traffic from a source node to a sink node in a network, where the objective is to maximize throughput. This is of interest, e.g., for providers of streaming content in communication networks. The overall path latency, which was relevant in other non-cooperative network routing games such as the classic Wardrop model, is of lesser c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Game Theory

سال: 2023

ISSN: ['1432-1270', '0020-7276']

DOI: https://doi.org/10.1007/s00182-022-00834-z